An Improved Parallel AGE Method to Solve Incomplete Blow-up Problem through High Performance Computing System
نویسندگان
چکیده
Incomplete blow-up is a condition under the quasilinear heat equation. The Porous Medium Equation (PME) with power source are admitting incomplete blow-up. It is used as one of the filtration process in the industry. This filtration process has been used globally in the medical and laboratory applications. Previously, the standard numerical procedure was Gauss Seidel method to solve this problem. We propose a new variance of the Alternating Group Explicit Scheme (AGE) algorithms to solve incomplete blow-up problem through High performance computing (HPC). HPC systems include of multiple (usually mass-produced) processors linked together in a single system with commercially available interconnects. This is in contrast to mainframe computers, which are generally monolithic in nature. Four important terms that are, convergent rate by the number of iteration, execution time, computational complexity and stability are considered in this study to evaluate the performances of this approach.
منابع مشابه
Parallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملA Hybrid Neural Network Approach for Kinematic Modeling of a Novel 6-UPS Parallel Human-Like Mastication Robot
Introduction we aimed to introduce a 6-universal-prismatic-spherical (UPS) parallel mechanism for the human jaw motion and theoretically evaluate its kinematic problem. We proposed a strategy to provide a fast and accurate solution to the kinematic problem. The proposed strategy could accelerate the process of solution-finding for the direct kinematic problem by reducing the number of required ...
متن کاملParallel Numerical Algorithms: an Introduction
The rapidly evolving field of parallel computing has seen four eras, substantially overlapping, yet progressive. The first, which we could label the Stone Age, was characterized by having speed-up as its primary objective (" Solve my problem faster... "). The tyranny of Amdahl's Law, combined with architectural convergence to systems that added memory in fixed proportion to processors, led to t...
متن کامل